基于PSO-BP神经网络的油船中部结构优化

以舱段质量为目标函数,以相关规范要求的板厚及应力为约束条件,通过灵敏度分析确定设计变量,对油船中部结构优化。构建基于粒子群优化的BP神经网络模型,并代替有限元分析确定应力与设计变量之间关系,从而对舱段进行结构优化。优化后舱段质量降低了4.2%,优化后的有限元分析结果表明满足规范要求,PSOBP神经网络模型在船舶结构优化设计中具有可行性。     

基于神经网络的小时间粒度交通流预测模型

为解决传统车队离散模型基于概率分布假设和现有交通流预测时间粒度过大不能应用于自适应信号配时优化等问题.在车队离散模型的建模思路上,先分析了下游交叉口车辆到达与上游交叉口车辆离去之间的关系,基于此构建了基于神经网络的小时间粒度交通流预测模型.该模型以上游交叉口离去流量分布为输入,下游交叉口到达流量分布为输出,时间粒度为5 s.最后,通过实际调查数据标定模型参数并应用模型预测下游交叉口到达流量.结果表明,与Robertson模型相比,本文模型预测结果能够更好地反映交通流的变化特征,平均预测误差减少了8.3%.成果可用于信号配时优化.     

The symmetric intersection design and traffic control optimization

It is well recognized that the left-turning movement reduces the intersection capacity significantly, because exclusive left turn phases are needed to discharge left turn vehicles only. This paper proposes the concept of Left-Hand Traffic (LHT) arterial, on where vehicles follow left-hand traffic rules as in England and India. The unconventional intersection where a LHT arterial intersects with a Right-Hand Traffic (RHT) arterial is named as symmetric intersection. It is only need three basic signal phases to separate all conflicts at symmetric intersection, while it at least need four signal phases at a conventional intersection. So, compared with the conventional intersection, the symmetric intersection can provide longer green time for the left-turning and the through movement, which can increase the capacity significantly. Through-movement waiting areas (TWAs) can be set at the symmetric intersection effectively, which can increase the capacity and short the cycle length furthermore. And the symmetric intersection is Channelized to improve the safety of TWAs. The Binary-Mixed-Integer-Linear-Programming (BMILP) model is employed to formulate the capacity maximization problem and signal cycle length minimization problem of the symmetric intersection. The BMILP model can be solved by standard branch-and-bound algorithms efficiently and outputs the lane allocation, signal timing decisions, and other decisions. Experiments analysis shows that the symmetric intersection with TWAs can increase the capacity and short the signal cycle length.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.     

Foldable container in empty container repositioning in intermodal transportation network of Belt and Road Initiative: strengths and limitations

In 2013, the concept of the ‘Silk Road Economic Belt and the 21st-Century Maritime Silk Road (Belt and Road)’ was initiated by the Chinese government, which involves Asian, European and African continents and their adjacent seas. Logistics plays a core role in such a large framework of economy and trade. In recent years, China, European Union, and Southeast Asia pay much attention to the design and development of the intermodal transportation network towards both economic and environmental efficiency. In this paper, we propose an empty container repositioning model in the intermodal transportation network of Belt and Road (B&R) Initiative by considering both standard and foldable containers. In this model, empty containers are repositioned from the inland of the original area, such as China, to other areas of B&R Initiative related countries and regions, such as European Union and Southeast Asia. We develop a mixed integer linear programming model to determine the optimal repositioning of empty containers via the intermodal transportation network. An Artificial Bee Colony algorithm is developed to solve large size problems in practice and numerical experiments are conducted to show the efficiency of our proposed algorithm. We provide managerial insights regarding the impact on the network performance of foldable containers transportation.     

基于NFFD 算法的船体几何变形技术

本文以非均匀有理B样条基函数作为参数体属性,并结合非均匀控制点网格,建立了适用于船体几何的NFFD变形技术。重点阐述了NFFD方法的基本原理和变形规则,并以矩阵表示方法为基础构建了数学模型。研究了控制点数量和分布对变形结果的影响,增加了控制点变形几何的能力并获得了更大的设计空间。最后,以某CNG运输船为例完成了球鼻艏、船艏和船艉部分几何的自动变形。本文的工作为船型优化提供了良好的变形工具。     

近岸深水联排灌注桩施工工艺优化

采用传统的冲孔灌注桩施工工艺进行海上灌注桩施工时,往往会面临适用条件限制、环境污染、施工成本增加等问题。针对三亚凤凰岛项目海上冲孔灌注桩施工特点,介绍通过优化钢平台结构形式及布局设计、泥浆循环系统优化设计、结构稳定性计算、"四新设备"创新应用等措施,有效降低施工成本、提高施工效率、减少环境污染、提高施工质量。结果表明采取的工艺优化和平台改进措施效果良好、实用性强。     

宽浅河道低水头水电枢纽口门区通航水流条件研究

根据重力相似准则,采用比尺为1∶100的整体模型,进行某宽浅河道低水头水电枢纽口门区的通航安全性研究。采用ADV三维流速测量系统进行流速测量;采用标准矩形量水堰控制模型流量;采用差动式尾门调节模型水位。由于河道地形及枢纽布置的原因,上游口门区流速过大,下游口门区形成大范围回流。通过扩大河道过流面积,移除下游河道中心连续小岛,增加闸孔等措施,减小下泄水流流速,改善河道整体水流状态;通过加长导航墙,改变导航墙透水面积,优化口门区域地形等措施极大地改善了船闸上下游引航道及口门区通航水流条件,确保过闸船舶的安全。     

Optimization of horizontal alignment geometry in road design and reconstruction

This paper presents a general formulation for optimization of horizontal road alignment, composed of tangential segments and circular curves suitably connected with transition curves (clothoids). It consists of a constrained optimization problem where the objective function is given by a line integral along the layout. The integrand is a function representing the cost of the road going through each point and, by considering different costs, a wide range of problems can be included in this formulation. To show it, we apply this methodology to three different situations. The two first cases are related with the design of a new road layout and used to solve a pair of academic examples. The third problem deals with the improvement of a road adapting the old path to current legislation, and it is solved taking as case study the reconstruction project for a regional road (NA-601) in the north of Spain.